Scalable Visualization of Semantic Nets using Power-Law Graphs
نویسندگان
چکیده
منابع مشابه
Scalable Visualization of Semantic Nets using Power-Law Graphs
Scalability and performance implications of semantic net visualization techniques are open research challenges. This paper focuses on developing a visualization technique that mitigates these challenges. We present a novel approach that exploits the underlying concept of power-law degree distribution as many realistic semantic nets seems to possess a power law degree distribution and present a ...
متن کاملScalable Computing for Power Law Graphs: Experience with Parallel PageRank
In this paper we report on the behavior of parallel numerical algorithms applied to computing the PageRank vector for a 1.5 billion node directed webgraph. We also describe the details of our parallel implementation that was able to compute the PageRank vector for this webgraph on a distributed memory 140 processor RLX cluster in under 6 minutes. Historically, much of the work in parallel compu...
متن کاملDrawing Power Law Graphs
We present methods for drawing graphs that arise in various information networks. It has been noted that many realistic graphs have power law degree distribution and exhibit the small world phenomenon. Our algorithm is influenced by recent developments on modeling and analysis of such power law graphs.
متن کاملScalable Percolation Search in Power Law Networks
We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a probabilistic broadcast algorithm, where a query message is relayed on each edge with probability just above the bond percolation threshold of the network. We show that if each node caches its directory via a sho...
متن کاملEigenvalues of Random Power Law Graphs
Many graphs arising in various information networks exhibit the “power law” behavior – the number of vertices of degree k is proportional to k−β for some positive β. We show that if β > 2.5, the largest eigenvalue of a random power law graph is almost surely (1 + o(1)) √ m where m is the maximum degree. Moreover, the k largest eigenvalues of a random power law graph with exponent β have power l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Information Sciences
سال: 2014
ISSN: 1935-0090,2325-0399
DOI: 10.12785/amis/080145